Reliable shortest path finding in stochastic networks with spatial correlated link travel times
نویسندگان
چکیده
Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR China c Department of Land Surveying & Geo-Informatics, The Hong Kong Polytechnic University, Hong Kong, PR China
منابع مشابه
Using Stochastic-Dominance Relationships for Bounding Travel Times in Stochastic Networks
We consider stochastic networks in which link travel times are dependent, discrete random variables. We present methods for computing bounds on path travel times using stochastic dominance relationships among link travel times, and discuss techniques for controlling tightness of the bounds. We apply these methods to shortest-path problems, show that the proposed algorithm can provide bounds on ...
متن کاملOptimal Routing Policy Problems in Stochastic Time- Dependent Networks
We study optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent distributions. These are fundamental network optimization problems for a wide variety of applications, such as transportation and telecommunication systems. The routing problems studied can be viewed as counterparts of shortest path problems...
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملShortest path problem considering on-time arrival probability
This paper studies the problem of finding a priori shortest paths to guarantee a given likelihood of arriving on-time in a stochastic network. Such ‘‘reliable” paths help travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. Optimal solutions to the problem can be obtained from local-reliable paths, which are a set of non-dominated pat...
متن کاملPii: S0191-2615(98)00016-2
ÐThe dynamic and stochastic shortest path problem (DSSPP) is de®ned as ®nding the expected shortest path in a trac network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of Geographical Information Science
دوره 26 شماره
صفحات -
تاریخ انتشار 2012